Crowdsourcing to Smartphones: Incentive Mechanism Design for Mobile Phone Sensing

Mobile phone sensing is a new paradigm which takes advantage of the pervasive smartphones to collect and analyze data beyond the scale of what was previously possible. In a mobile phone sensing system, the platform recruits smartphone users to provide sensing service. Existing mobile phone sensing applications and systems lack good incentive mechanisms that can attract more user participation. To address this issue, we design incentive mechanisms for mobile phone sensing. We consider two system models: the platform-centric model where the platform provides a reward shared by participating users, and the user-centric model where users have more control over the payment they will receive. For the platform-centric model, we design an incentive mechanism using a Stackelberg game, where the platform is the leader while the users are the followers. We show how to compute the unique Stackelberg Equilibrium, at which the utility of the platform is maximized, and none of the users can improve its utility by unilaterally deviating from its current strategy. For the user-centric model, we design an auction-based incentive mechanism, which is computationally efficient, individually rational, profitable, and truthful. Through extensive simulations, we evaluate the performance and validate the theoretical properties of our incentive mechanisms

Effect of Interfacial Atomic Mixing on the Thermal Conductivity of Multi-Layered Stacking Structure

Multi-layered stacking structures and atomic mixing interfaces were constructed. The effects of various factors on the thermal conductivity of different lattice structures were studied by non-equilibrium molecular dynamics simulations, including the number of atomic mixing layers, temperature, total length of the system, and period length. The results showed that the mixing of two and four layers of atoms can improve the thermal conductivities of the multi-layer structure with a small total length due to a phonon bridge mechanism. When the total length of the system is large, the thermal conductivity of the multi-layer structure with atomic mixing interfaces decreases significantly compared with that of the perfect interfaces. The interfacial atom mixing destroys the phonon coherent transport in the multi-layer structure and decreases the thermal conductivity to some extent. The thermal conductivity of the multi-layer structure with perfect interfaces is significantly affected by temperature, whereas the thermal conductivity of the multi-layer structures with atomic mixing is less sensitive to temperature

Sensing as a service: A cloud computing system for mobile phone sensing

Sensors on (or attached to) mobile phones can enable attractive sensing applications in different domains such as environmental monitoring, social networking, healthcare, etc. We introduce a new concept, Sensing-as-a-Service (S2aaS), i.e., providing sensing services using mobile phones via a cloud computing system. An S2aaS cloud should meet the following requirements: 1) It must be able to support various mobile phone sensing applications on different smartphone platforms. 2) It must be energy-efficient. 3) It must have effective incentive mechanisms that can be used to attract mobile users to participate in sensing activities. In this paper, we identify unique challenges of designing and implementing an S2aaS cloud, review existing systems and methods, present viable solutions, and point out future research directions

Survivable Virtual Infrastructure Mapping in Virtualized Data Centers

In a virtualized data center, survivability can be enhanced by creating redundant VMs as backup for VMs such that after VM or server failures, affected services can be quickly switched over to backup VMs. To enable flexible and efficient resource management, we propose to use a service-aware approach in which multiple correlated Virtual Machines (VMs) and their backups are grouped together to form a Survivable Virtual Infrastructure (SVI) for a service or a tenant. A fundamental problem in such a system is to determine how to map each SVI to a physical data center network such that operational costs are minimized subject to the constraints that each VM’s resource requirements are met and bandwidth demands between VMs can be guaranteed before and after failures. This problem can be naturally divided into two sub-problems: VM Placement (VMP) and Virtual Link Mapping (VLM). We present a general optimization framework for this mapping problem. Then we present an efficient algorithm for the VMP subproblem as well as a polynomial-time algorithm that optimally solves the VLM subproblem, which can be used as subroutines in the framework. We also present an effective heuristic algorithm that jointly solves the two subproblems. It has been shown by extensive simulation results based on the real VM data traces collected from the green data center at Syracuse University that compared with the First Fit Descending (FFD) and single shortest path based baseline algorithm, both our VMP+VLM algorithm and joint algorithm significantly reduce the reserved bandwidth, and yield comparable results in terms of the number of active servers

GPS: a comprehensive www server for phosphorylation sites prediction

Protein phosphorylation plays a fundamental role in most of the cellular regulatory pathways. Experimental identification of protein kinases' (PKs) substrates with their phosphorylation sites is labor-intensive and often limited by the availability and optimization of enzymatic reactions. Recently, large-scale analysis of the phosphoproteome by the mass spectrometry (MS) has become a popular approach. But experimentally, it is still difficult to distinguish the kinase-specific sites on the substrates. In this regard, the in silico prediction of phosphorylation sites with their specific kinases using protein's primary sequences may provide guidelines for further experimental consideration and interpretation of MS phosphoproteomic data. A variety of such tools exists over the Internet and provides the predictions for at most 30 PK subfamilies. We downloaded the verified phosphorylation sites from the public databases and curated the literature extensively for recently found phosphorylation sites. With the hypothesis that PKs in the same subfamily share similar consensus sequences/motifs/functional patterns on substrates, we clustered the 216 unique PKs in 71 PK groups, according to the BLAST results and protein annotations. Then, we applied the group-based phosphorylation scoring (GPS) method on the data set; here, we present a comprehensive PK-specific prediction server GPS, which could predict kinase-specific phosphorylation sites from protein primary sequences for 71 different PK groups. GPS has been implemented in PHP and is available on a www server at